Local transport measurements on epitaxial graphene

Growth of large-scale graphene is still accompanied by imperfections. By means of a four-tip STM/SEM the local structure of graphene grown on SiC(0001) was correlated with scanning electron microscope images and spatially resolved transport measurements. The systematic variation of probe spacings and substrate temperature has clearly revealed two-dimensional transport regimes of Anderson localization as well as of diffusive transport. The detailed analysis of the temperature dependent data demonstrates that the local on-top nano-sized contacts do not induce significant strain to the epitaxial graphene films.Comment: 3 figure

Cache policies for cloud-based systems: To keep or not to keep

In this paper, we study cache policies for cloud-based caching. Cloud-based caching uses cloud storage services such as Amazon S3 as a cache for data items that would have been recomputed otherwise. Cloud-based caching departs from classical caching: cloud resources are potentially infinite and only paid when used, while classical caching relies on a fixed storage capacity and its main monetary cost comes from the initial investment. To deal with this new context, we design and evaluate a new caching policy that minimizes the overall cost of a cloud-based system. The policy takes into account the frequency of consumption of an item and the cloud cost model. We show that this policy is easier to operate, that it scales with the demand and that it outperforms classical policies managing a fixed capacity.Comment: Proceedings of IEEE International Conference on Cloud Computing 2014 (CLOUD 14

Inner Parallel Sets in Mixed-Integer Optimization

This thesis contains an extensive study of inner parallel sets in mixed-integer optimization. Inner parallel sets are a recent idea in this context and offer a possibility to relax the difficulties imposed by integrality constraints by guaranteeing feasibility of roundings of their (continuous) elements. To be able to use inner parallel sets algorithmically, various modifications, such as their enlargements and inner and outer approximations, are helpful and sometimes even necessary. Such ideas are introduced and investigated in this thesis, both theoretically as well as computationally. From our theoretical study of inner parallel sets emerge a number of feasible rounding approaches which mainly focus on the computation of good feasible points for mixed-integer linear and nonlinear minimization problems. Good feasible points are useful in the context of solving these problems by providing tight upper bounds on the objective value. In especially difficult cases, feasible rounding approaches may also be considered as an alternative to solving a problem. The contributions of this thesis include a thorough discussion of possibilities to enlarge inner parallel sets in the linear as well as in the nonlinear setting. Moreover, we introduce a novel cutting plane method based on inner parallel sets for mixed-integer convex minimization problems. This method, in addition to computing a good feasible point, also provides a lower bound on the objective value which is another important ingredient for solving such minimization problems. We study the possibility of dealing with equality constraints on integer variables which at first glance seem to prevent a nonempty inner parallel set. Under the occurrence of such constraints, we show that inner parallel sets can be nonempty in a reduced variable space, which allows the application of feasible rounding approaches. Finally, we investigate the behavior of inner parallel sets when integrated into search trees. Our study gives rise to a novel diving method which turns out to be a major improvement over standalone feasible rounding approaches. We test the introduced methods on standard libraries for mixed-integer linear, convex and nonconvex minimization problems separately in several computational studies. The computational results illustrate the potential of our ideas

Constructing highly arc transitive digraphs using a layerwise direct product

We introduce a construction of highly arc transitive digraphs using a layerwise direct product. This product generalizes some known classes of highly arc transitive digraphs but also allows to construct new such. We use the product to obtain counterexamples to a conjecture by Cameron, Praeger and Wormald on the structure of certain highly arc transitive digraphs.Comment: 16 page

Pretty Private Group Management

Group management is a fundamental building block of today's Internet applications. Mailing lists, chat systems, collaborative document edition but also online social networks such as Facebook and Twitter use group management systems. In many cases, group security is required in the sense that access to data is restricted to group members only. Some applications also require privacy by keeping group members anonymous and unlinkable. Group management systems routinely rely on a central authority that manages and controls the infrastructure and data of the system. Personal user data related to groups then becomes de facto accessible to the central authority. In this paper, we propose a completely distributed approach for group management based on distributed hash tables. As there is no enrollment to a central authority, the created groups can be leveraged by various applications. Following this paradigm we describe a protocol for such a system. We consider security and privacy issues inherently introduced by removing the central authority and provide a formal validation of security properties of the system using AVISPA. We demonstrate the feasibility of this protocol by implementing a prototype running on top of Vuze's DHT

An Empirical Analysis of the Currency Hedging Behavior of North German SMEs

In a globalized world, companies are able to sell their products or services abroad or purchase them abroad. This generates advantages due to the expansion of the business area creating a broader market but comes along with currency risks. This paper examines which factors influence German SMEs' willingness to conduct foreign business, respectively to do transactions in foreign currencies. An empirical study researches how the currency risk in North German SMEs is valued and assessed. The analysis further identifies the differences in the use of foreign currencies of rural and urban SMEs and examines the reasons for the use of foreign currencies and currency management which lead to the use of currency hedging. With a sample size of 73 SMEs the study aims for a better understanding of the foreign activities of German SMEs and investigates the approach to the currency risk management for a better understanding of their needs. In general, the paper shows that the larger a company is, the more likely is the use of a currency management. A comparison of rural and urban SMEs in Northern Germany reveals, that urban ones are larger and therefore more likely to use currency hedging. Based on the research, the paper provides recommendations for SMEs with foreign sales.O